On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
نویسندگان
چکیده
منابع مشابه
An Efficient Shortest-Path Aided Back-Pressure Routing over Multihop Wireless Network
This project proposes a new optimal routing/scheduling back-pressure algorithm that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortest-path information in order to minimize average path lengths between each source and destination pair. Our results indicate that under the traditional back-pressure algorithm, the en...
متن کاملDistributed Weighted Node Shortest Path Routing for Wireless Sensor Networks
Routing in Wireless Sensor Networks contains challenges, including limited energy constraints, network density, wireless channel errors. Different approaches exist in literature to overcome these challenges, such as data centric, location based and hierarchical routing. Most routing protocols in Wireless Sensor Networks are dealing with energy efficiency and network lifetime. In this paper, we ...
متن کاملMinimum Delay Routing in Multihop Wireless Networks
End-to-end delay is an important QoS metric in multihop wireless networks such as sensor networks and mesh networks. Along with throughput, end-to-end delay determines the user-experienced data transmission time. End-to-end delay refers to the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the route and the interference l...
متن کاملRouting in Random Multihop Wireless Networks
A. Proof of Lemma 2 Lemma 2 We have ∠wut ≤ α if ‖uv‖+‖vw‖ ≤ r, ∠vut ≤ α and ∠wvt ≤ α. Proof: Without loss of generality, we assume that node v is on top of the line crossing u and t. Let 2xuy and 2avb be the sectors of the forwarding region defined by node u and v respectively for destination node t. To prove the lemma, it is equivalent to show that the intersected region by 2avb with disk D(u,...
متن کاملShortest-path and Hot-potato Routing on Unbuuered Toroidal Networks
We probabilistically model dynamic packet routing on unbuuered 2-D and 3-D toroidal networks. We consider shortest-path routing with packet loss and retrans-missions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node throughput, and average packet latency indicate that the proposed ALB strate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2011
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2010.2094204